On relativized probabilistic polynomial time algorithms
نویسندگان
چکیده
منابع مشابه
Polynomial Time Algorithms for Testing Probabilistic Bisimulation and Simulation
Various models and equivalence relations or preorders for probabilistic processes are proposed in the literature. This paper deals with a model based on labelled transition systems extended to the prob-abalistic setting and gives an O(n 2 m) algorithm for testing probabilistic bisimulation and an O(n 5 m 2) algorithm for testing probabilistic simulation where n is the number of states and m the...
متن کاملPolynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations
We show that one can approximate the least fixed point solution for a multivariate system of monotone probabilistic max (min) polynomial equations, referred to as maxPPSs (and minPPSs, respectively), in time polynomial in both the encoding size of the system of equations and in log(1/ǫ), where ǫ > 0 is the desired additive error bound of the solution. (The model of computation is the standard T...
متن کاملPolynomial-Time Approximation Algorithms
• Assume that the input is random, and find an algorithm that will perform well in the average case. For example, the maximum clique problem, which is NP -hard, can actually be solved efficiently assuming a random input because the maximum clique in a randomly chosen graph is small. This assumption is often used in practice, but the problem is that not everyone will agree on whether the input d...
متن کاملHierarchies of Relativized Time - Bounded
Some results on relativized time-bounded complexity classes are presented. There can be many kinds of hierarchies of complexity subclasses of relativized NP. For brevity, let P(A, k) \NP(A, k)} be the relativized complexity class DTIME^(/i*) [resp. NTIME^/i*)] with respect to oracle set A. (For k=l, replace n by 2ri). Then for example: 1). There is an oracle set A such that for all k>Q P(A, k) ...
متن کاملGeneral Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an optimal solution. The number of iterations required to be within ε of optimality grows linearly with 1/ε and quadratically with the number m of variables. The working set selection can be performed in polynomial time. If...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Mathematical Society of Japan
سال: 1997
ISSN: 0025-5645
DOI: 10.2969/jmsj/04910015